1824A - LuoTianyi and the Show - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;
#define int long long


const int N = 200010;

int st[N];
int a[N];
void solve(){
	int n,m;cin>> n >> m;
	for(int i=1;i<=n;i++)cin>> a[i];
	int x = 0,y = 0;
	for(int i=1;i<=m;i++)st[i] = 0;
	for(int i=1;i<=n;i++){
		if(a[i]==-1)x++;
		else if(a[i]==-2)y++;
		else st[a[i]]=1;
	}

	int ans = 0;
	for(int i=m;i;i--){
		if(st[i])ans++;
	}
	int k = m-ans;
	int cnt = 0;
	int res = 0;
	for(int i=1;i<=m;i++){
		if(st[i])
			res = max(res,ans+min(x,cnt)+min(y,k-cnt));
		else
			cnt ++;
	}
	res = max(res,max(x,y)+ans);
	cout<<min(res,m)<<endl;
}


signed main(){
	int _;cin>>_;while(_--)
	solve();
	
}